Optimal Elliptic-Curve Subspaces for Applications in Double-Authenticated Requests in Mobile Distributed Data Mining

Mathematical models based on elliptic curves have been intensively studied since their applicability in data security systems was discovered. In this article, the authors describe optimal way to select particular subspaces over which are defined, showing of these secure transfer. Access large databases and analyses requests made required daily by a variety users, including legal entities. An attack communication causes violations privacy damage to/theft that can be worth EUR tens billions annually. For between computers, encryption methods used as adequate computing power energy. from fixed mobile systems, if distributed heterogeneously, authenticate both users answering entities determines efficiency proposed solution. To address limitation, our study proposes double-authentication method elliptic-curve systems.